Constructive spherical codes near the Shannon bound
نویسندگان
چکیده
منابع مشابه
Constructive spherical codes near the Shannon bound
Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance ρ. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of ρ. The construction is based on the Yaglom map combined with some finite sphere packings obtained from nonconstructive codes for the Euclidean metric. Concatenat...
متن کاملNear Shannon Limit Performance of Low Density Parity Check Codes
We report the empirical performance of Gallager’s low density parity check codes on Gaussian channels. We show that performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of Turbo codes. A linear code may be described in terms of a generator matrix G or in terms of a pari...
متن کاملAsymptotically dense spherical codes - Part h Wrapped spherical codes
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show tha...
متن کاملAsymptotically Dense Spherical Codes—Part I: Wrapped Spherical Codes
A new class of spherical codes called wrapped spherical codes is constructed by “wrapping” any sphere packing in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of , and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of as the minimum distance approaches zero. We show tha...
متن کاملAsymptotically dense spherical codes - Part II: Laminated spherical codes
New spherical codes called laminated spherical codes are constructed in dimensions 2–49 using a technique similar to the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension. Laminated spherical codes outperform the best known spherical codes in the minimum distance sense for many code sizes. The density of a lam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2012
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-012-9633-2